Monadic translation of classical sequent calculus
نویسندگان
چکیده
منابع مشابه
Monadic translation of classical sequent calculus
We study monadic translations of the call-by-name (cbn) and the call-by-value (cbv) fragments of the classical sequent calculus λμμ̃ by Curien and Herbelin and give modular and syntactic proofs of strong normalization. The target of the translations is a new meta-language for classical logic, named monadic λμ. It is a monadic reworking of Parigot’s λμ-calculus, where the monadic binding is confi...
متن کاملMonadic Translation of Intuitionistic Sequent Calculus
This paper proposes and analyses a monadic translation of an intuitionistic sequent calculus. The source of the translation is a typed λ-calculus previously introduced by the authors, corresponding to the intuitionistic fragment of the call-by-name variant of λμμ̃ of Curien and Herbelin, and the target is a variant of Moggi’s monadic meta-language, where the rewrite relation includes extra permu...
متن کاملSecond-Order Classical Sequent Calculus
We present a sequent calculus that allows to abstract over a type variable. The introduction of the abstraction on the right-hand side of a sequent corresponds to the universal quantification; whereas, the introduction of the abstraction on the lefthand side of a sequent corresponds to the existential quantification. The calculus provides a correspondence with second-order classical proposition...
متن کاملApproaches to Polymorphism in Classical Sequent Calculus
X is a relatively new, untyped calculus, invented to give a CurryHoward correspondence with Classical Implicative Sequent Calculus. It is already known to provide a very expressive language; embeddings have been defined of the λ-calculus, Bloo and Rose’s λx, Parigot’s λμ and Curien and Herbelin’s λμμ̃. We investigate various notions of polymorphism in the context of the X -calculus. In particula...
متن کاملA Classical Sequent Calculus with Dependent Types
Dependent types are a key feature of type systems, typically used in the context of both richly-typed programming languages and proof assistants. Control operators, which are connected with classical logic along the proof-as-program correspondence, are known to misbehave in the presence of dependent types, unless dependencies are restricted to values. We place ourselves in the context of the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2013
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129512000436